Matlis category equivalences for a ring epimorphism
نویسندگان
چکیده
منابع مشابه
Category equivalences involving graded modules over path algebras of quivers
Let Q be a finite quiver with vertex set I and arrow set Q1, k a field, and k Q its path algebra with its standard grading. This paper proves some category equivalences involving the quotient category QGr(k Q) := Gr(k Q)/Fdim(k Q) of graded k Q-modules modulo those that are the sum of their finite dimensional submodules, namely QGr(k Q) ≡ ModS(Q) ≡ GrL(Q) ≡ ModL(Q◦)0 ≡ QGr(k Q (n)). Here S(Q) =...
متن کاملA Convenient Model Category for Commutative Ring Spectra
We develop a new system of model structures on the modules, algebras and commutative algebras over symmetric spectra. In addition to the same properties as the standard stable model structures defined in [HSS] and [MMSS], these model structures have better compatibility properties between commutative algebras and the underlying modules.
متن کاملIdempotent Residuated Structures: Some Category Equivalences and Their Applications
This paper concerns residuated lattice-ordered idempotent commutative monoids that are subdirect products of chains. An algebra of this kind is a generalized Sugihara monoid (GSM) if it is generated by the lower bounds of the monoid identity; it is a Sugihara monoid if it has a compatible involution ¬. Our main theorem establishes a category equivalence between GSMs and relative Stone algebras ...
متن کاملOn Matlis Dualizing Modules
We consider rings admitting a Matlis dualizing module E. We argue that if R admits two such dualizing modules, then a module is reflexive with respect to one if and only if it is reflexive with respect to the other. Using this fact we argue that the number (whether finite or infinite) of distinct dualizing modules equals the number of distinct invertible (R,R)-bimodules. We show by example that...
متن کاملOn the subgraph epimorphism problem
In this paper we study the problem of deciding the existence of a subgraph epimorphism between two graphs. Our interest in this variant of graph matching problem stems from the study of model reductions in systems biology, where large systems of biochemical reactions can be naturally represented by bipartite digraphs of species and reactions. In this setting, model reduction can be formalized a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2020
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2020.106398